Cyclotomy and difference families in elementary abelian groups
نویسندگان
چکیده
منابع مشابه
Pseudo-Free Families of Finite Computational Elementary Abelian p-Groups
We initiate the study of (weakly) pseudo-free families of computational elementary abelian pgroups, where p is an arbitrary fixed prime. We restrict ourselves to families of computational elementary abelian p-groups Gd such that for every index d, each element of Gd is represented by a single bit string of length polynomial in the length of d. First, we prove that pseudo-freeness and weak pseud...
متن کاملGeneralizations of Partial Difference Sets from Cyclotomy to Nonelementary Abelian p-Groups
A partial difference set having parameters (n2, r(n − 1), n + r2 − 3r, r2 − r) is called a Latin square type partial difference set, while a partial difference set having parameters (n2, r(n + 1),−n + r2 + 3r, r2 + r) is called a negative Latin square type partial difference set. In this paper, we generalize well-known negative Latin square type partial difference sets derived from the theory o...
متن کاملModules for Elementary Abelian p-groups
Let E ∼= (Z/p)r (r ≥ 2) be an elementary abelian p-group and let k be an algebraically closed field of characteristic p. A finite dimensional kE-module M is said to have constant Jordan type if the restriction of M to every cyclic shifted subgroup of kE has the same Jordan canonical form. I shall begin by discussing theorems and conjectures which restrict the possible Jordan canonical form. The...
متن کاملDifference sets in abelian 2-groups
If G is an abelian group of order u, and D is a subset of G with k elements such that every nonidentity element can be expressed 2 times in the form a b, where a and b are elements of D, then D is called a (u, k, A) difference set in G. The order n of the difference set is k 1. In this paper we consider the parameter values v = 22di 2, k = 22d+ ’ 24 ,I= 22d 2d, and n=22d. The rank r of G is the...
متن کاملCritical sets in the elementary abelian 2- and 3- groups
In 1998, Khodkar showed that the minimal critical set in the Latin square corresponding to the elementary abelian 2-group of order 16 is of size at most 124. Since the paper was published, improved methods for solving integer programming problems have been developed. Here we give an example of a critical set of size 121 in this Latin square, found through such methods. We also give a new upper ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1972
ISSN: 0022-314X
DOI: 10.1016/0022-314x(72)90009-1